The t-median function on graphs
نویسندگان
چکیده
منابع مشابه
The t-median function on graphs
Amedian of a sequence π = x1, x2, . . . , xk of elements of a finite metric space (X, d) is an element x for which ∑k i=1 d(x, xi) is minimum. The function M with domain the set of all finite sequences on X and defined by M(π) = {x : x is a median of π} is called the median function on X, and is one of the most studied consensus functions. Based on previous characterizations of median sets M(π)...
متن کاملOn the remoteness function in median graphs
A profile on a graph G is any nonempty multiset whose elements are vertices from G. The corresponding remoteness function associates to each vertex x ∈ V (G) the sum of distances from x to the vertices in the profile. Starting from some nice and useful properties of the remoteness function in hypercubes, the remoteness function is studied in arbitrary median graphs with respect to their isometr...
متن کاملOn Median Graphs and Median Grid Graphs on Median Graphs and Median Grid Graphs
Let e be an edge of a median graph G which is contained in exactly one 4-cycle. Then it is proved that G n e is a median graph. The converse holds as well provided that e is not contained is a subgraph isomorphic to the 3-cube minus a vertex. These results are used to give several characterizations of median grid graphs. (Grid graphs are subgraphs of complete grids, i.e. of the Cartesian produc...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملOn median graphs and median grid graphs
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djoković-Winkler’s relation Θ and let h be the number of Q3’s in G. Then we prove that 2n −m − k + h = 2. We also characterize median grid graphs in several different ways, for instance, they are the grid graphs with m− n + 1 squares. To obtain these results we introduce the notion of square...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2006
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.04.023